翻訳と辞書 Words near each other ・ Word on tha Streets (Bad Azz album) ・ Word on tha Streets (Skatterman & Snug Brim album) ・ Word on the Street ・ Word on the Street (album) ・ Word on the Street (newspaper) ・ Word order ・ Word painting ・ Word Party ・ Word play ・ Word polygon ・ Word Power ・ Word Power (album) ・ Word Power Books ・ Word problem ・ Word problem (mathematics education) ・ Word problem (mathematics) ・ Word problem for groups ・ Word processor ・ Word Processor of the Gods ・ Word Puzzle (video game) ・ Word Realms ・ Word recognition ・ Word Records ・ Word Rescue ・ Word Riot ・ Word salad ・ Word Salad (album) ・ Word search ・ Word sense ・ Word sketch Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Word problem (mathematics) ： ウィキペディア英語版 Word problem (mathematics) In mathematics and computer science, a word problem for a set S with respect to a system of finite encodings of its elements is the algorithmic problem of deciding whether two given representatives represent the same element of the set. The problem is commonly encountered in abstract algebra, where given a presentation of an algebraic structure by generators and relators, the problem is to determine if two expressions represent the same element; a prototypical example is the word problem for groups. Less formally, the word problem in an algebra is: given a set of identities ''E'', and two expressions ''x'' and ''y'', is it possible to transform ''x'' into ''y'' using the identities in ''E'' as rewriting rules in both directions? While answering this question may not seem hard, the remarkable (and deep) result that emerges, in many important cases, is that the problem is undecidable. Many, if not most all, undecidable problems in mathematics can be posed as word problems; see the list of undecidable problems for many examples. == Background and motivation == Many occasions arise in mathematics where one wishes to use a finite amount of information to describe an element of a (typically infinite) set. This issue is particularly apparent in computational mathematics. Traditional models of computation (such as the Turing machine) have storage capacity which is unbounded, so it is in principle possible to perform computations with the elements of infinite sets. On the other hand, since the amount of storage space in use at any one time is finite, we need each element to have a finite representation. For various reasons, it is not always possible or desirable to use a system of ''unique'' encodings, that is, one in which every element has a single encoding. When using an encoding system without uniqueness, the question naturally arises of whether there is an algorithm which, given as input two encodings, decides whether they represent the same element. Such an algorithm is called a ''solution to the word problem'' for the encoding system. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Word problem (mathematics)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.